Prudent Self-Avoiding Walks
نویسندگان
چکیده
We have produced extended series for prudent self-avoiding walks on the square lattice. These are subsets of self-avoiding walks. We conjecture the exact growth constant and critical exponent for the walks, and show that the (anisotropic) generating function is almost certainly not differentiably-finite.
منابع مشابه
Exact solution of two classes of prudent polygons
Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex of the walk is adjacent to its first one. More precisely, we give the half-perimeter generating functions of two subclasses of prudent polygons on the square lattice, which turn out to be ...
متن کاملFamilies of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that have been counted so far in that they can wind around their starting point. Their enumeration was first addressed by Préa in 1997. He defined 4 classes of prudent walks, of increasing generality, and wrote a system of re...
متن کاملThe enumeration of prudent polygons by area and its unusual asymptotics
Prudent walks are special self-avoiding walks that never take a step towards an already occupied site, and k-sided prudent walks (with k = 1, 2, 3, 4) are, in essence, only allowed to grow along k directions. Prudent polygons are prudent walks that return to a point adjacent to their starting point. Prudent walks and polygons have been previously enumerated by length and perimeter (Bousquet-Mél...
متن کاملWeakly prudent self-avoiding bridges
We define and enumerate a new class of self-avoiding walks on the square lattice, which we call weakly prudent bridges. Their definition is inspired by two previously-considered classes of self-avoiding walks, and can be viewed as a combination of those two models. We consider several methods for recursively generating these objects, each with its own advantages and disadvantages, and use these...
متن کاملSome New Self-avoiding Walk and Polygon Models
We study the behaviour of prudent, perimeter and quasi-prudent self-avoiding walks and polygons in both two and three dimensions, as well as some solvable subsets. Our analysis combines exact solutions of some simpler cases, careful asymptotic analysis of functional equations which can be obtained in more complicated cases and extensive numerical studies based on exact series expansions for les...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Entropy
دوره 10 شماره
صفحات -
تاریخ انتشار 2008